An efficient method for the three-dimensional container loading problem by forming box sizes

نویسندگان

چکیده

This study focuses on a real-world case that is defined as an extension of the container loading problem (CLP) with weakly heterogeneous types boxes. A company producing plastic cups wants to increase its efficiency in operations. To solve problem, hybrid approach including static rule rank orders and integer nonlinear programming (INLP) models developed. INLP form box sizes according properties cups, determine position boxes layers while simultaneously minimizing layer-depth. The presented tested cases benchmark data sets. results show forming solving CLP increases effectiveness

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Method For The Three Dimensional Container Packing Problem

A new algorithm for solving the three dimensional container packing problem is proposed in this paper. This new algorithm deviates from the traditional approach of wall building and layering. It uses the concept of “building growing” from multiple sides of the container. We tested our method using all 760 test cases from the OR-Library. Experimental results indicate that the new algorithm is ab...

متن کامل

An Online Packing Heuristic for the Three-Dimensional Container Loading Problem in Dynamic Environments and the Physical Internet

In this paper, we consider the online three-dimensional container loading problem. We develop a novel online packing algorithm to solve the threedimensional bin packing problem in the online case where items are not know well in advance and they have to be packed in real-time when they arrive. This is relevant in many real-world scenarios such as automated cargo loading in warehouses. This is a...

متن کامل

Algorithms for the Container Loading Problem

In this paper we consider the three-dimensional problem of optimal packing of a container with rectangular pieces. We propose an approximation algorithm based on the "forward state strategy" of dynamic programming. A suitable description of packings is developed for the implementation of the approximation algorithm, and some computational experience is reported. Zusammenfassung: Zur nn aherungs...

متن کامل

Heuristics for the container loading problem

The knapsack container loading problem is the problem of loading a subset of rectangular boxes into a rectangular container of fixed dimensions such that the volume of the packed boxes is maximized. A new heuristic based on the wall-building approach is proposed, which decomposes the problem into a number of layers which again are split into a number of strips. The packing of a strip may be for...

متن کامل

Three-Dimensional Container Loading Using a Cooperative Co-evolutionaryGenetic Algorithm

This paper presents the use of a cooperative co-evolutionary genetic algorithm (CCGA) in conjunction with a heuristic rule for solving a 3D container loading or bin packing problem. Unlike previous works which concentrate on using either a heuristic rule or an optimisation technique to find an optimal sequence of packages which must be loaded into the containers, the proposed heuristic rule is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Engineering Optimization

سال: 2021

ISSN: ['1029-0273', '0305-215X', '1026-745X']

DOI: https://doi.org/10.1080/0305215x.2021.1913734